Fault-Tolerant Broadcasting in Toroidal Networks
نویسندگان
چکیده
A non-redundant fault-tolerant broadcasting algorithm in a faulty k-ary n-cube is designed. The algorithm can adapt up to (2n 2) node failures. Compared to the optimal algorithm in a fault-free k-ary n-cube, the proposed algorithm requires at most 3 extra communication steps in the case of cut through packet routing and (n + 1) extra steps in the case of store-and-forward routing. Conditions under which this algorithm works correctly in a general toroidal network are given.
منابع مشابه
Broadcasting with Many Faulty Links
We study the problem of broadcasting in point-to-point networks with faulty links. The usual approach in which the number of faulty links in each step is bounded by a fixed constant does not reflect the intuition that the probability of a certain link to fail while transmitting a particular message is a fixed constant. In our model the number of faulty links in a given step depends on the total...
متن کاملBinary linear programming models for robust broadcasting in communication networks
Broadcasting is an information dissemination process in communication networks whereby a message, originated at any node of a network, is transmitted to all other nodes of the network. In c-broadcasting, each node having the message completes up to c transmissions to its neighbors over the communication lines in one time unit. In a kfault tolerant c-broadcast network, the broadcasting process c...
متن کاملTopology and Routing Algorithms of Double-Loops Connected Petersen Graph Networks
Petersen graph has good performance in parallel and distributed computation because of its characteristics such as short diameter and regularity. On the basis of topology of double-loops, a new double-loops connected Petersen graph network DLCPG(k) is constructed. In addition, unicasting, broadcasting and a kind of fault-tolerant routing algorithms are designed respectively. It is proved that D...
متن کاملFault-Tolerant Broadcasting on the Arrangement Graph
This paper proposes a distributed fault-tolerant algorithm for one-to-all broadcasting in the oneport communication model on the arrangement graph. Exploiting the hierarchical properties of the arrangement graph to constitute different-sized broadcasting trees for different-sized subgraphs, we propose a distributed algorithm with optimal time complexity and without message redundancy for one-to...
متن کاملCayley graph connected cycles: A new class of fixed-degree interconnection networks
We introduce a new class of fixed-degree interconnection networks, called the Cayley graph connected cycles , which includes the well known cube-connected cycles as a special case. This class of networks is shown to be vertexsymmetric and maximally fault tolerant (if the given Cayley graph is maximally fault tolerant). We propose simple routing and broadcasting algorithms for these networks in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998